منابع مشابه
Lexicographical Order
procedure ari thmetic (a, b, c, op); in t eger a, b, c, op; ¢ o n l m e n t This procedure will perform different order ar i thmetic operations with b and c, put t ing the result in a. The order of the operation is given by op. For op = 1 addit ion is performed. For op = 2 multiplicaLion, repeated addition, is done. Beyond these the operations are non-commutat ive. For op = 3 exponentiat ion, r...
متن کاملReflections on Lexicographical User Research*
The last decades have seen a growing interest in theoretical and practical problems related to lexicographical user research. Starting with a discussion of the concept of lexicographically relevant user needs, this contribution analyses, utilising the lexicographical function theory, various types of needs to be taken into account when doing this kind of research. It then discusses the positive...
متن کاملRule based lexicographical permutation sequences
In a permutation sequence built by means of sub permutations, the transitions between successive permutations are subject to a set of n(n – 1)/2 rules that naturally group into n – 1 matrices with a high degree of regularity. By means of these rules, the sequence can be produced in O(3n!) time and O(n) space. To generate all permutations of a given set one can go for (among other things) a mini...
متن کاملOn lexicographical ordering in multivariate mathematical morphology
Since mathematical morphology is based on complete lattice theory, a vector ordering method becomes indispensable for its extension to multivariate images. Among the several approaches developed with this purpose, lexicographical orderings are by far the most frequent, as they possess certain desirable theoretical properties. However, their main drawback consists of the excessive priority attri...
متن کاملOptimal Cost Parallel Algorithms for Lexicographical Ordering
for sorting n integers from the range !!.) algorithm p Optimal cost parallel algorithms for lexicographical ordering on a CREW PRAM are log n presented here. An 0 (I ( ) og nIp {I•...• n} usingp :::;; n processors is given here. Also an algorithm for sorting n strings of size lover an alphabet of size s is presented. that requires 0 ( log n[ ) .!!!.. + !.... ) units of time log (nllp p p and it...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1987
ISSN: 0024-3795
DOI: 10.1016/0024-3795(87)90312-0